On Solving Fuzzy Knapsack Problem by Multistage Decision Making using Dynamic Programming
نویسندگان
چکیده
This paper considers knapsack problem with fuzzy weights, says fuzzy knapsack problem (FKP). Here we introduce possibility index which gives the possibility of choosing the items with fuzzy weights for knapsack with crisp capacity. In this paper a dynamic programming technique has been introduced to optimize the utility value of objective function. An algorithm has been proposed which gives the optimal solution for FKP with some possibility. The possibility index gives an idea to choose the solution according to decision maker’s choice. An illustrative example is given to demonstrate the methodology.
منابع مشابه
Fuzzy Dynamic System Approach to Multistage Decision Making Problems
Many decisions involve multiple stages of choices and events. In this paper to develops fuzzy dynamic system approach for solving multistage decision-making problems. Fuzzy dynamic system is a promising tool for dealing with multistage decision-making and optimization problems under fuzziness. The cases of deterministic, stochastic, fuzzy dynamic system, fuzzy criterion set dynamic programming,...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملMeasuring a Dynamic Efficiency Based on MONLP Model under DEA Control
Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. Standard DEA models are quite limited models, in the sense that they do not consider a DMU at different times. To resolve this problem, DEA models with dynamic structures have been proposed.In a recent pape...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کامل